0.03/0.12	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.03/0.12	% Command    : run_E %s %d THM
0.11/0.31	% Computer : n027.cluster.edu
0.11/0.31	% Model    : x86_64 x86_64
0.11/0.31	% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.11/0.31	% Memory   : 8042.1875MB
0.11/0.31	% OS       : Linux 3.10.0-693.el7.x86_64
0.11/0.31	% CPULimit   : 1440
0.11/0.31	% WCLimit    : 180
0.11/0.31	% DateTime   : Thu Jul  4 11:11:38 EDT 2024
0.11/0.31	% CPUTime    : 
0.17/0.45	Running higher-order theorem proving
0.17/0.49	Running: /export/starexec/sandbox/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=180 /export/starexec/sandbox/tmp/tmp.vgqLuFGGo0/E---3.1_1457.p
0.56/0.63	# Version: 3.2.0-ho
0.56/0.63	# Preprocessing class: HSLMSMSSLLLCHSA.
0.56/0.63	# Scheduled 6 strats onto 8 cores with 180 seconds (1440 total)
0.56/0.63	# Starting lpo1_fix with 540s (3) cores
0.56/0.63	# Starting full_lambda_9 with 180s (1) cores
0.56/0.63	# Starting almost_fo_4 with 180s (1) cores
0.56/0.63	# Starting new_ho_9 with 180s (1) cores
0.56/0.63	# Starting pre_casc_4 with 180s (1) cores
0.56/0.63	# Starting ho_unfolding_6 with 180s (1) cores
0.56/0.63	# full_lambda_9 with pid 1633 completed with status 0
0.56/0.63	# Result found by full_lambda_9
0.56/0.63	# Preprocessing class: HSLMSMSSLLLCHSA.
0.56/0.63	# Scheduled 6 strats onto 8 cores with 180 seconds (1440 total)
0.56/0.63	# Starting lpo1_fix with 540s (3) cores
0.56/0.63	# Starting full_lambda_9 with 180s (1) cores
0.56/0.63	# SinE strategy is GSinE(CountFormulas,hypos,4,,3,20000,3.0,true)
0.56/0.63	# Search class: HGHSM-FSLM32-DHSMMSBN
0.56/0.63	# partial match(1): HGHSM-FSLM32-MHSMMSBN
0.56/0.63	# Scheduled 12 strats onto 1 cores with 180 seconds (180 total)
0.56/0.63	# Starting full_lambda_5 with 15s (1) cores
0.56/0.63	# full_lambda_5 with pid 1648 completed with status 0
0.56/0.63	# Result found by full_lambda_5
0.56/0.63	# Preprocessing class: HSLMSMSSLLLCHSA.
0.56/0.63	# Scheduled 6 strats onto 8 cores with 180 seconds (1440 total)
0.56/0.63	# Starting lpo1_fix with 540s (3) cores
0.56/0.63	# Starting full_lambda_9 with 180s (1) cores
0.56/0.63	# SinE strategy is GSinE(CountFormulas,hypos,4,,3,20000,3.0,true)
0.56/0.63	# Search class: HGHSM-FSLM32-DHSMMSBN
0.56/0.63	# partial match(1): HGHSM-FSLM32-MHSMMSBN
0.56/0.63	# Scheduled 12 strats onto 1 cores with 180 seconds (180 total)
0.56/0.63	# Starting full_lambda_5 with 15s (1) cores
0.56/0.63	# Preprocessing time       : 0.006 s
0.56/0.63	# Presaturation interreduction done
0.56/0.63	
0.56/0.63	# Proof found!
0.56/0.63	# SZS status Theorem
0.56/0.63	# SZS output start CNFRefutation
0.56/0.63	thf(decl_22, type, is_of: $i > ($i > $o) > $o).
0.56/0.63	thf(decl_23, type, all_of: ($i > $o) > ($i > $o) > $o).
0.56/0.63	thf(decl_25, type, in: $i > $i > $o).
0.56/0.63	thf(decl_61, type, imp: $o > $o > $o).
0.56/0.63	thf(decl_62, type, d_not: $o > $o).
0.56/0.63	thf(decl_67, type, l_or: $o > $o > $o).
0.56/0.63	thf(decl_72, type, l_some: $i > ($i > $o) > $o).
0.56/0.63	thf(decl_77, type, e_is: $i > $i > $i > $o).
0.56/0.63	thf(decl_123, type, nat: $i).
0.56/0.63	thf(decl_124, type, n_is: $i > $i > $o).
0.56/0.63	thf(decl_127, type, n_some: ($i > $o) > $o).
0.56/0.63	thf(decl_142, type, n_pl: $i > $i > $i).
0.56/0.63	thf(decl_147, type, diffprop: $i > $i > $i > $o).
0.56/0.63	thf(decl_149, type, iii: $i > $i > $o).
0.56/0.63	thf(decl_152, type, lessis: $i > $i > $o).
0.56/0.63	thf(decl_155, type, esk1_0: $i).
0.56/0.63	thf(decl_156, type, esk2_0: $i).
0.56/0.63	thf(decl_157, type, esk3_0: $i).
0.56/0.63	thf(decl_158, type, esk4_0: $i).
0.56/0.63	thf(def_d_not, axiom, ((d_not)=(^[X36:$o]:((imp @ ((X36)) @ (~($true)))))), file('/export/starexec/sandbox/tmp/tmp.vgqLuFGGo0/E---3.1_1457.p', def_d_not)).
0.56/0.63	thf(def_imp, axiom, ((imp)=(^[X34:$o, X35:$o]:(((X34)=>(X35))))), file('/export/starexec/sandbox/tmp/tmp.vgqLuFGGo0/E---3.1_1457.p', def_imp)).
0.56/0.63	thf(def_iii, axiom, ((iii)=(^[X1:$i, X185:$i]:((n_some @ (diffprop @ X185 @ X1))))), file('/export/starexec/sandbox/tmp/tmp.vgqLuFGGo0/E---3.1_1457.p', def_iii)).
0.56/0.63	thf(def_l_or, axiom, ((l_or)=(^[X42:$o]:(imp @ ((d_not @ ((X42))))))), file('/export/starexec/sandbox/tmp/tmp.vgqLuFGGo0/E---3.1_1457.p', def_l_or)).
0.56/0.63	thf(def_e_is, axiom, ((e_is)=(^[X1:$i, X60:$i, X61:$i]:(((X60)=(X61))))), file('/export/starexec/sandbox/tmp/tmp.vgqLuFGGo0/E---3.1_1457.p', def_e_is)).
0.56/0.63	thf(def_lessis, axiom, ((lessis)=(^[X1:$i, X188:$i]:((l_or @ ((iii @ X1 @ X188)) @ ((n_is @ X1 @ X188)))))), file('/export/starexec/sandbox/tmp/tmp.vgqLuFGGo0/E---3.1_1457.p', def_lessis)).
0.56/0.63	thf(def_n_some, axiom, ((n_some)=(l_some @ nat)), file('/export/starexec/sandbox/tmp/tmp.vgqLuFGGo0/E---3.1_1457.p', def_n_some)).
0.56/0.63	thf(def_n_is, axiom, ((n_is)=(^[Z0/* 19 */:$i, Z1:$i]:(((Z0)=(Z1))))), file('/export/starexec/sandbox/tmp/tmp.vgqLuFGGo0/E---3.1_1457.p', def_n_is)).
0.56/0.63	thf(def_all_of, axiom, ((all_of)=(^[X3:$i > $o, X2:$i > $o]:(![X4:$i]:(((is_of @ X4 @ X3)=>(X2 @ X4)))))), file('/export/starexec/sandbox/tmp/tmp.vgqLuFGGo0/E---3.1_1457.p', def_all_of)).
0.56/0.63	thf(def_is_of, axiom, ((is_of)=(^[X1:$i, X2:$i > $o]:((X2 @ X1)))), file('/export/starexec/sandbox/tmp/tmp.vgqLuFGGo0/E---3.1_1457.p', def_is_of)).
0.56/0.63	thf(satz23a, conjecture, (all_of @ (^[X1:$i]:((in @ X1 @ nat))) @ (^[X1:$i]:((all_of @ (^[X213:$i]:((in @ X213 @ nat))) @ (^[X214:$i]:((all_of @ (^[X4:$i]:((in @ X4 @ nat))) @ (^[X4:$i]:((all_of @ (^[X10:$i]:((in @ X10 @ nat))) @ (^[X10:$i]:((((lessis @ X4 @ X10)=>(lessis @ (n_pl @ X1 @ X4) @ (n_pl @ X214 @ X10)))<=(lessis @ X1 @ X214)))))))))))))), file('/export/starexec/sandbox/tmp/tmp.vgqLuFGGo0/E---3.1_1457.p', satz23a)).
0.56/0.63	thf(satz22d, axiom, (all_of @ (^[X1:$i]:((in @ X1 @ nat))) @ (^[X1:$i]:((all_of @ (^[X205:$i]:((in @ X205 @ nat))) @ (^[X206:$i]:((all_of @ (^[X4:$i]:((in @ X4 @ nat))) @ (^[X4:$i]:((all_of @ (^[X10:$i]:((in @ X10 @ nat))) @ (^[X10:$i]:(((iii @ X1 @ X206)=>((iii @ (n_pl @ X1 @ X4) @ (n_pl @ X206 @ X10))<=(lessis @ X4 @ X10))))))))))))))), file('/export/starexec/sandbox/tmp/tmp.vgqLuFGGo0/E---3.1_1457.p', satz22d)).
0.56/0.63	thf(satz19c, axiom, (all_of @ (^[X1:$i]:((in @ X1 @ nat))) @ (^[X1:$i]:((all_of @ (^[X259:$i]:((in @ X259 @ nat))) @ (^[X260:$i]:((all_of @ (^[X4:$i]:((in @ X4 @ nat))) @ (^[X4:$i]:(((iii @ X1 @ X260)=>(iii @ (n_pl @ X1 @ X4) @ (n_pl @ X260 @ X4)))))))))))), file('/export/starexec/sandbox/tmp/tmp.vgqLuFGGo0/E---3.1_1457.p', satz19c)).
0.56/0.63	thf(satz19f, axiom, (all_of @ (^[X1:$i]:((in @ X1 @ nat))) @ (^[X1:$i]:((all_of @ (^[X285:$i]:((in @ X285 @ nat))) @ (^[X286:$i]:((all_of @ (^[X4:$i]:((in @ X4 @ nat))) @ (^[X4:$i]:(((iii @ X1 @ X286)=>(iii @ (n_pl @ X4 @ X1) @ (n_pl @ X4 @ X286)))))))))))), file('/export/starexec/sandbox/tmp/tmp.vgqLuFGGo0/E---3.1_1457.p', satz19f)).
0.56/0.63	thf(c_0_14, plain, ((d_not)=(^[Z0/* 3 */:$o]:(((((Z0))=>(~($true))))))), inference(fof_simplification,[status(thm)],[def_d_not])).
0.56/0.63	thf(c_0_15, plain, ((imp)=(^[Z0/* 19 */:$o, Z1:$o]:(((Z0)=>(Z1))))), inference(fof_simplification,[status(thm)],[def_imp])).
0.56/0.63	thf(c_0_16, plain, ((iii)=(^[Z0/* 19 */:$i, Z1:$i]:((l_some @ nat @ (diffprop @ Z1 @ Z0))))), inference(fof_simplification,[status(thm)],[def_iii])).
0.56/0.63	thf(c_0_17, plain, ((l_or)=(^[Z0/* 19 */:$o, Z1:$o]:((((((((Z0)))=>(~($true)))))=>(Z1))))), inference(fof_simplification,[status(thm)],[def_l_or])).
0.56/0.63	thf(c_0_18, plain, ((d_not)=(^[Z0/* 3 */:$o]:(((((Z0))=>(~($true))))))), inference(apply_def,[status(thm)],[c_0_14, c_0_15])).
0.56/0.63	thf(c_0_19, plain, ((e_is)=(^[Z0/* 19 */:$i, Z1:$i, Z2:$i]:(((Z1)=(Z2))))), inference(fof_simplification,[status(thm)],[def_e_is])).
0.56/0.63	thf(c_0_20, plain, ((lessis)=(^[Z0/* 19 */:$i, Z1:$i]:(((((((((((l_some @ nat @ (diffprop @ Z1 @ Z0))))))=>(~($true)))))=>((((Z0)=(Z1))))))))), inference(fof_simplification,[status(thm)],[def_lessis])).
0.56/0.63	thf(c_0_21, plain, ((iii)=(^[Z0/* 19 */:$i, Z1:$i]:((l_some @ nat @ (diffprop @ Z1 @ Z0))))), inference(apply_def,[status(thm)],[c_0_16, def_n_some])).
0.56/0.63	thf(c_0_22, plain, ((l_or)=(^[Z0/* 19 */:$o, Z1:$o]:((((((((Z0)))=>(~($true)))))=>(Z1))))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_17, c_0_15]), c_0_18])).
0.56/0.63	thf(c_0_23, axiom, ((n_is)=(^[Z0/* 19 */:$i, Z1:$i]:(((Z0)=(Z1))))), inference(apply_def,[status(thm)],[def_n_is, c_0_19])).
0.56/0.63	thf(c_0_24, plain, ((all_of)=(^[Z0/* 19 */:$i > $o, Z1:$i > $o]:(![X4:$i]:((((Z0 @ X4))=>(Z1 @ X4)))))), inference(fof_simplification,[status(thm)],[def_all_of])).
0.56/0.63	thf(c_0_25, plain, ((is_of)=(^[Z0/* 19 */:$i, Z1:$i > $o]:((Z1 @ Z0)))), inference(fof_simplification,[status(thm)],[def_is_of])).
0.56/0.63	thf(c_0_26, plain, ((lessis)=(^[Z0/* 19 */:$i, Z1:$i]:(((((((((((l_some @ nat @ (diffprop @ Z1 @ Z0))))))=>(~($true)))))=>((((Z0)=(Z1))))))))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_20, c_0_21]), c_0_22]), c_0_23])).
0.56/0.63	thf(c_0_27, plain, ((all_of)=(^[Z0/* 19 */:$i > $o, Z1:$i > $o]:(![X4:$i]:((((Z0 @ X4))=>(Z1 @ X4)))))), inference(apply_def,[status(thm)],[c_0_24, c_0_25])).
0.56/0.63	thf(c_0_28, negated_conjecture, ~(![X393:$i]:(((in @ X393 @ nat)=>![X392:$i]:(((in @ X392 @ nat)=>![X391:$i]:(((in @ X391 @ nat)=>![X390:$i]:(((in @ X390 @ nat)=>((((l_some @ nat @ (diffprop @ X392 @ X393))=>~($true))=>((X393)=(X392)))=>((((l_some @ nat @ (diffprop @ X390 @ X391))=>~($true))=>((X391)=(X390)))=>(((l_some @ nat @ (diffprop @ (n_pl @ X392 @ X390) @ (n_pl @ X393 @ X391)))=>~($true))=>((n_pl @ X393 @ X391)=(n_pl @ X392 @ X390)))))))))))))), inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[satz23a])]), c_0_26]), c_0_27])])).
0.56/0.63	thf(c_0_29, plain, ![X457:$i]:(((in @ X457 @ nat)=>![X456:$i]:(((in @ X456 @ nat)=>![X455:$i]:(((in @ X455 @ nat)=>![X454:$i]:(((in @ X454 @ nat)=>((l_some @ nat @ (diffprop @ X456 @ X457))=>((((l_some @ nat @ (diffprop @ X454 @ X455))=>~($true))=>((X455)=(X454)))=>(l_some @ nat @ (diffprop @ (n_pl @ X456 @ X454) @ (n_pl @ X457 @ X455))))))))))))), inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[satz22d]), c_0_26]), c_0_21]), c_0_27])])).
0.56/0.63	thf(c_0_30, negated_conjecture, ((in @ esk1_0 @ nat)&((in @ esk2_0 @ nat)&((in @ esk3_0 @ nat)&((in @ esk4_0 @ nat)&((((l_some @ nat @ (diffprop @ esk2_0 @ esk1_0))|((esk1_0)=(esk2_0)))&(($true)|((esk1_0)=(esk2_0))))&((((l_some @ nat @ (diffprop @ esk4_0 @ esk3_0))|((esk3_0)=(esk4_0)))&(($true)|((esk3_0)=(esk4_0))))&((~(l_some @ nat @ (diffprop @ (n_pl @ esk2_0 @ esk4_0) @ (n_pl @ esk1_0 @ esk3_0)))|~($true))&((n_pl @ esk1_0 @ esk3_0)!=(n_pl @ esk2_0 @ esk4_0))))))))), inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_28])])])])])).
0.56/0.63	thf(c_0_31, plain, ![X661:$i, X662:$i, X663:$i, X664:$i]:(((~(l_some @ nat @ (diffprop @ X664 @ X663))|~($true)|(l_some @ nat @ (diffprop @ (n_pl @ X662 @ X664) @ (n_pl @ X661 @ X663)))|~(l_some @ nat @ (diffprop @ X662 @ X661))|~(in @ X664 @ nat)|~(in @ X663 @ nat)|~(in @ X662 @ nat)|~(in @ X661 @ nat))&(((X663)!=(X664))|(l_some @ nat @ (diffprop @ (n_pl @ X662 @ X664) @ (n_pl @ X661 @ X663)))|~(l_some @ nat @ (diffprop @ X662 @ X661))|~(in @ X664 @ nat)|~(in @ X663 @ nat)|~(in @ X662 @ nat)|~(in @ X661 @ nat)))), inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_29])])])])])).
0.56/0.63	thf(c_0_32, negated_conjecture, (~((l_some @ nat @ (diffprop @ (n_pl @ esk2_0 @ esk4_0) @ (n_pl @ esk1_0 @ esk3_0))))|~(($true))), inference(split_conjunct,[status(thm)],[c_0_30])).
0.56/0.63	thf(c_0_33, plain, ![X1:$i, X4:$i, X5:$i, X6:$i]:(((l_some @ nat @ (diffprop @ (n_pl @ X5 @ X1) @ (n_pl @ X6 @ X4)))|~((l_some @ nat @ (diffprop @ X1 @ X4)))|~(($true))|~((l_some @ nat @ (diffprop @ X5 @ X6)))|~((in @ X1 @ nat))|~((in @ X4 @ nat))|~((in @ X5 @ nat))|~((in @ X6 @ nat)))), inference(split_conjunct,[status(thm)],[c_0_31])).
0.56/0.63	thf(c_0_34, negated_conjecture, ~((l_some @ nat @ (diffprop @ (n_pl @ esk2_0 @ esk4_0) @ (n_pl @ esk1_0 @ esk3_0)))), inference(cn,[status(thm)],[c_0_32])).
0.56/0.63	thf(c_0_35, plain, ![X1:$i, X6:$i, X5:$i, X4:$i]:(((l_some @ nat @ (diffprop @ (n_pl @ X5 @ X1) @ (n_pl @ X6 @ X4)))|~((in @ X6 @ nat))|~((in @ X5 @ nat))|~((in @ X4 @ nat))|~((in @ X1 @ nat))|~((l_some @ nat @ (diffprop @ X5 @ X6)))|~((l_some @ nat @ (diffprop @ X1 @ X4))))), inference(cn,[status(thm)],[c_0_33])).
0.56/0.63	thf(c_0_36, negated_conjecture, (in @ esk1_0 @ nat), inference(split_conjunct,[status(thm)],[c_0_30])).
0.56/0.63	thf(c_0_37, negated_conjecture, (in @ esk2_0 @ nat), inference(split_conjunct,[status(thm)],[c_0_30])).
0.56/0.63	thf(c_0_38, negated_conjecture, (in @ esk3_0 @ nat), inference(split_conjunct,[status(thm)],[c_0_30])).
0.56/0.63	thf(c_0_39, negated_conjecture, (in @ esk4_0 @ nat), inference(split_conjunct,[status(thm)],[c_0_30])).
0.56/0.63	thf(c_0_40, negated_conjecture, (~((l_some @ nat @ (diffprop @ esk2_0 @ esk1_0)))|~((l_some @ nat @ (diffprop @ esk4_0 @ esk3_0)))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34, c_0_35]), c_0_36]), c_0_37]), c_0_38]), c_0_39])])).
0.56/0.63	thf(c_0_41, negated_conjecture, ((l_some @ nat @ (diffprop @ esk4_0 @ esk3_0))|((esk3_0)=(esk4_0))), inference(split_conjunct,[status(thm)],[c_0_30])).
0.56/0.63	thf(c_0_42, plain, ![X423:$i]:(((in @ X423 @ nat)=>![X422:$i]:(((in @ X422 @ nat)=>![X421:$i]:(((in @ X421 @ nat)=>((l_some @ nat @ (diffprop @ X422 @ X423))=>(l_some @ nat @ (diffprop @ (n_pl @ X422 @ X421) @ (n_pl @ X423 @ X421)))))))))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[satz19c]), c_0_21]), c_0_27])).
0.56/0.63	thf(c_0_43, negated_conjecture, (((esk4_0)=(esk3_0))|~((l_some @ nat @ (diffprop @ esk2_0 @ esk1_0)))), inference(spm,[status(thm)],[c_0_40, c_0_41])).
0.56/0.63	thf(c_0_44, plain, ![X628:$i, X629:$i, X630:$i]:((~(in @ X628 @ nat)|(~(in @ X629 @ nat)|(~(in @ X630 @ nat)|(~(l_some @ nat @ (diffprop @ X629 @ X628))|(l_some @ nat @ (diffprop @ (n_pl @ X629 @ X630) @ (n_pl @ X628 @ X630)))))))), inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_42])])])])).
0.56/0.63	thf(c_0_45, negated_conjecture, (~((l_some @ nat @ (diffprop @ (n_pl @ esk2_0 @ esk3_0) @ (n_pl @ esk1_0 @ esk3_0))))|~((l_some @ nat @ (diffprop @ esk2_0 @ esk1_0)))), inference(spm,[status(thm)],[c_0_34, c_0_43])).
0.56/0.63	thf(c_0_46, plain, ![X5:$i, X4:$i, X1:$i]:(((l_some @ nat @ (diffprop @ (n_pl @ X4 @ X5) @ (n_pl @ X1 @ X5)))|~((in @ X1 @ nat))|~((in @ X4 @ nat))|~((in @ X5 @ nat))|~((l_some @ nat @ (diffprop @ X4 @ X1))))), inference(split_conjunct,[status(thm)],[c_0_44])).
0.56/0.63	thf(c_0_47, negated_conjecture, ((l_some @ nat @ (diffprop @ esk2_0 @ esk1_0))|((esk1_0)=(esk2_0))), inference(split_conjunct,[status(thm)],[c_0_30])).
0.56/0.63	thf(c_0_48, negated_conjecture, ~((l_some @ nat @ (diffprop @ esk2_0 @ esk1_0))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45, c_0_46]), c_0_38]), c_0_37]), c_0_36])])).
0.56/0.63	thf(c_0_49, plain, ![X440:$i]:(((in @ X440 @ nat)=>![X439:$i]:(((in @ X439 @ nat)=>![X438:$i]:(((in @ X438 @ nat)=>((l_some @ nat @ (diffprop @ X439 @ X440))=>(l_some @ nat @ (diffprop @ (n_pl @ X438 @ X439) @ (n_pl @ X438 @ X440)))))))))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[satz19f]), c_0_21]), c_0_27])).
0.56/0.63	thf(c_0_50, negated_conjecture, ((esk2_0)=(esk1_0)), inference(sr,[status(thm)],[c_0_47, c_0_48])).
0.56/0.63	thf(c_0_51, plain, ![X645:$i, X646:$i, X647:$i]:((~(in @ X645 @ nat)|(~(in @ X646 @ nat)|(~(in @ X647 @ nat)|(~(l_some @ nat @ (diffprop @ X646 @ X645))|(l_some @ nat @ (diffprop @ (n_pl @ X647 @ X646) @ (n_pl @ X647 @ X645)))))))), inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_49])])])])).
0.56/0.63	thf(c_0_52, negated_conjecture, ~((l_some @ nat @ (diffprop @ (n_pl @ esk1_0 @ esk4_0) @ (n_pl @ esk1_0 @ esk3_0)))), inference(spm,[status(thm)],[c_0_34, c_0_50])).
0.56/0.63	thf(c_0_53, plain, ![X5:$i, X4:$i, X1:$i]:(((l_some @ nat @ (diffprop @ (n_pl @ X5 @ X4) @ (n_pl @ X5 @ X1)))|~((in @ X1 @ nat))|~((in @ X4 @ nat))|~((in @ X5 @ nat))|~((l_some @ nat @ (diffprop @ X4 @ X1))))), inference(split_conjunct,[status(thm)],[c_0_51])).
0.56/0.63	thf(c_0_54, negated_conjecture, ((n_pl @ esk1_0 @ esk3_0)!=(n_pl @ esk2_0 @ esk4_0)), inference(split_conjunct,[status(thm)],[c_0_30])).
0.56/0.63	thf(c_0_55, negated_conjecture, ~((l_some @ nat @ (diffprop @ esk4_0 @ esk3_0))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52, c_0_53]), c_0_36]), c_0_39]), c_0_38])])).
0.56/0.63	thf(c_0_56, negated_conjecture, ((n_pl @ esk1_0 @ esk4_0)!=(n_pl @ esk1_0 @ esk3_0)), inference(rw,[status(thm)],[c_0_54, c_0_50])).
0.56/0.63	thf(c_0_57, negated_conjecture, ((esk4_0)=(esk3_0)), inference(sr,[status(thm)],[c_0_41, c_0_55])).
0.56/0.63	thf(c_0_58, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_56, c_0_57])]), ['proof']).
0.56/0.63	# SZS output end CNFRefutation
0.56/0.63	# Parsed axioms                        : 396
0.56/0.63	# Removed by relevancy pruning/SinE    : 263
0.56/0.63	# Initial clauses                      : 358
0.56/0.63	# Removed in clause preprocessing      : 181
0.56/0.63	# Initial clauses in saturation        : 177
0.56/0.63	# Processed clauses                    : 388
0.56/0.63	# ...of these trivial                  : 5
0.56/0.63	# ...subsumed                          : 96
0.56/0.63	# ...remaining for further processing  : 287
0.56/0.63	# Other redundant clauses eliminated   : 26
0.56/0.63	# Clauses deleted for lack of memory   : 0
0.56/0.63	# Backward-subsumed                    : 5
0.56/0.63	# Backward-rewritten                   : 6
0.56/0.63	# Generated clauses                    : 780
0.56/0.63	# ...of the previous two non-redundant : 750
0.56/0.63	# ...aggressively subsumed             : 0
0.56/0.63	# Contextual simplify-reflections      : 1
0.56/0.63	# Paramodulations                      : 582
0.56/0.63	# Factorizations                       : 2
0.56/0.63	# NegExts                              : 2
0.56/0.63	# Equation resolutions                 : 32
0.56/0.63	# Disequality decompositions           : 0
0.56/0.63	# Total rewrite steps                  : 122
0.56/0.63	# ...of those cached                   : 105
0.56/0.63	# Propositional unsat checks           : 0
0.56/0.63	#    Propositional check models        : 0
0.56/0.63	#    Propositional check unsatisfiable : 0
0.56/0.63	#    Propositional clauses             : 0
0.56/0.63	#    Propositional clauses after purity: 0
0.56/0.63	#    Propositional unsat core size     : 0
0.56/0.63	#    Propositional preprocessing time  : 0.000
0.56/0.63	#    Propositional encoding time       : 0.000
0.56/0.63	#    Propositional solver time         : 0.000
0.56/0.63	#    Success case prop preproc time    : 0.000
0.56/0.63	#    Success case prop encoding time   : 0.000
0.56/0.63	#    Success case prop solver time     : 0.000
0.56/0.63	# Current number of processed clauses  : 143
0.56/0.63	#    Positive orientable unit clauses  : 20
0.56/0.63	#    Positive unorientable unit clauses: 0
0.56/0.63	#    Negative unit clauses             : 16
0.56/0.63	#    Non-unit-clauses                  : 107
0.56/0.63	# Current number of unprocessed clauses: 650
0.56/0.63	# ...number of literals in the above   : 3289
0.56/0.63	# Current number of archived formulas  : 0
0.56/0.63	# Current number of archived clauses   : 126
0.56/0.63	# Clause-clause subsumption calls (NU) : 5137
0.56/0.63	# Rec. Clause-clause subsumption calls : 1188
0.56/0.63	# Non-unit clause-clause subsumptions  : 91
0.56/0.63	# Unit Clause-clause subsumption calls : 127
0.56/0.63	# Rewrite failures with RHS unbound    : 0
0.56/0.63	# BW rewrite match attempts            : 6
0.56/0.63	# BW rewrite match successes           : 2
0.56/0.63	# Condensation attempts                : 0
0.56/0.63	# Condensation successes               : 0
0.56/0.63	# Termbank termtop insertions          : 68100
0.56/0.63	# Search garbage collected termcells   : 18601
0.56/0.63	
0.56/0.63	# -------------------------------------------------
0.56/0.63	# User time                : 0.087 s
0.56/0.63	# System time              : 0.015 s
0.56/0.63	# Total time               : 0.102 s
0.56/0.63	# Maximum resident set size: 5136 pages
0.56/0.63	
0.56/0.63	# -------------------------------------------------
0.56/0.63	# User time                : 0.096 s
0.56/0.63	# System time              : 0.020 s
0.56/0.63	# Total time               : 0.116 s
0.56/0.63	# Maximum resident set size: 2372 pages
0.56/0.63	% E---3.1 exiting
1.05/0.63	% E exiting
1.05/0.63	EOF